On bipartite divisor graphs for group conjugacy class sizes
نویسندگان
چکیده
منابع مشابه
On bipartite zero-divisor graphs
A (finite or infinite) complete bipartite graph together with some end vertices all adjacent to a common vertex is called a complete bipartite graph with a horn. For any bipartite graph G, we show that G is the graph of a commutative semigroup with 0 if and only if it is one of the following graphs: star graph, two-star graph, complete bipartite graph, complete bipartite graph with a horn. We a...
متن کاملone-prime power hypothesis for conjugacy class sizes
a finite group $g$ satisfies the on-prime power hypothesis for conjugacy class sizes if any two conjugacy class sizes $m$ and $n$ are either equal or have a common divisor a prime power. taeri conjectured that an insoluble group satisfying this condition is isomorphic to $s times a$ where $a$ is abelian and $s cong psl_2(q)$ for $q in {4,8}$. we confirm this conjecture.
متن کاملon bipartite divisor graph for character degrees
the concept of the bipartite divisor graph for integer subsets has been considered in [m. a. iranmanesh and c. e. praeger, bipartite divisor graphs for integer subsets, {em graphs combin.}, {bf 26} (2010) 95--105.]. in this paper, we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph. we show that if $g...
متن کاملon bipartite divisor graph for character degrees
the concept of the bipartite divisor graph for integer subsets has been considered in [graph combinator., 26 (2010) 95--105.]. in this paper, we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph. we show that if $g$ is a solvable group, then the number of connected components of this graph is at most $2$ and if $g...
متن کاملOn Bipartite Divisor Graph for Character Degrees
The concept of the bipartite divisor graph for integer subsets has been considered in [M. A. Iranmanesh and C. E. Praeger, Bipartite divisor graphs for integer subsets, Graphs Combin., 26 (2010) 95–105.]. In this paper, we will consider this graph for the set of character degrees of a finite group G and obtain some properties of this graph. We show that if G is a solvable group, then the number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2009
ISSN: 0022-4049
DOI: 10.1016/j.jpaa.2009.01.015